Parallel Branch and Bound Algorithms on Internet Connected Workstations
نویسندگان
چکیده
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bound algorithms. Experiments have been carried out using two different applications, i.e. the Quadratic Assignment Problem (QAP) and the Traveling Salesman Problem (TSP). The results confirm the potential of the approach, and underline the requirements of the problem, algorithm and architecture for the approach to be successful.
منابع مشابه
A generalized utility for parallel branch and bound algorithms
Branch and bound algorithms are general methods applied to various combinatorial optimization problems. Recently, parallelizations of these algorithms have been proposed. In spite of the generality of these methods, many of the parallelizations have been set up for a speciic problem and a speciic parallel computer. In this paper, a generalized utility PUBB (Parallel-ization Utility for Branch a...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملControl Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branch-and-bound algorithm implementations can be divided in two types based on whether a central or a distributed control scheme is used. Central control schemes have reduced scalability because of...
متن کاملUsing a Hypercube Algorithm for Broadcasting in Internet-Based Clusters
Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way of obtaining great performance, it may not always be so. When using such a cluster for executing a parallel application, performance may not be as good as expected due to delays in communication. Also, the heterogeneit...
متن کاملMW: A Software Framework for Combinatorial Optimization on Computational Grids
Branch and bound is the backbone of many algorithms for solving combinatorial optimization problems, dating at least as far back as the work of Little, Murty, Sweeney, and Karel in solving the traveling salesman problem [18]. Branch and bound and similar tree-search techniques have been implemented on a variety of parallel computing platforms dating back to the advent of multiprocessor machines...
متن کامل